Termination Proof Script

Consider the TRS R consisting of the rewrite rules
1:    app(app(minus,x),0)  → x
2:    app(app(minus,app(s,x)),app(s,y))  → app(app(minus,x),y)
3:    app(f,0)  → app(s,0)
4:    app(f,app(s,x))  → app(app(minus,app(s,x)),app(g,app(f,x)))
5:    app(g,0)  → 0
6:    app(g,app(s,x))  → app(app(minus,app(s,x)),app(f,app(g,x)))
There are 11 dependency pairs:
7:    APP(app(minus,app(s,x)),app(s,y))  → APP(app(minus,x),y)
8:    APP(app(minus,app(s,x)),app(s,y))  → APP(minus,x)
9:    APP(f,0)  → APP(s,0)
10:    APP(f,app(s,x))  → APP(app(minus,app(s,x)),app(g,app(f,x)))
11:    APP(f,app(s,x))  → APP(minus,app(s,x))
12:    APP(f,app(s,x))  → APP(g,app(f,x))
13:    APP(f,app(s,x))  → APP(f,x)
14:    APP(g,app(s,x))  → APP(app(minus,app(s,x)),app(f,app(g,x)))
15:    APP(g,app(s,x))  → APP(minus,app(s,x))
16:    APP(g,app(s,x))  → APP(f,app(g,x))
17:    APP(g,app(s,x))  → APP(g,x)
The approximated dependency graph contains one SCC: {7,10,12-14,16,17}.
Tyrolean Termination Tool  (0.09 seconds)   ---  May 3, 2006